Optimal Oblivious Routing On D-Dimensional Meshes
نویسنده
چکیده
In this work we consider deterministic oblivious k-k routing algorithms with buffer size O(k). Our main focus lie is the design of algorithms for dimensional n n meshes, d> 1. For these networks we present asymptotically optimal O(kpnd) step oblivious k-k routing algorithms for all k and d > 1.
منابع مشابه
Oblivious Routing on d-Dimensional Meshes
We give new upper and lower bounds for oblivious permutation routing on d-dimensional meshes (d > 1) of side length n. We present O(nd=2 logn) algorithms for d 2 using queue-size 6. Further we present optimal O(nd=2) algorithms using unlimited queue-size. For odd d the presented algorithm is a d-bend algorithm. We further show that for odd d an algorithm which for every packet restrict the bend...
متن کاملA Lower Bound for Oblivious Dimensional Routing
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends only on the source and destination node of the packet. Furthermore packets use a shortest path with a minimal number of bends. We present an Ω(kn(d+1)/2) step lower bound for oblivious dimensional k-k routing algorithms...
متن کاملAn Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks
We present an optimal oblivious randomized algorithm for permutation routing on the MIMD version of Mesh. Our routing algorithm routes n2 elements on an n×n Mesh in 2n + O(log n) parallel communication steps with very high probability. Further, the maximum queue length at any node at any time is at the most O(log n) with the same probability. Since 2n is the distance bound for the Mesh, our alg...
متن کاملAspects of k-k routing in meshes and OTIS networks
Efficient data transport in parallel computers build on sparse interconnection networks is crucial for their performance. A basic transport problem in such a computer is the k-k routing problem. In this thesis, aspects of the k-k routing problem on r-dimensional meshes and OTIS-G networks are discussed. The first oblivious routing algorithms for these networks are presented that solve the k-k r...
متن کاملRandomized Routing on Meshes with Buses
We give algorithms and lower bounds for the problem of routing k-permutations on d-dimensional MIMD meshes with additional buses. A straightforward argument shows that for all d 1, 2=3 n steps are required for routing permutations (the case k = 1) on a d-dimensional mesh. We prove that routing permutations on d-dimensional meshes requires at least (1 ? 1=d) n steps. For small d better lower bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 333 شماره
صفحات -
تاریخ انتشار 2003